Simultaneous Matrix Diagonalization: the Overcomplete Case
نویسنده
چکیده
Many algorithms for Independent Component Analysis rely on a simultaneous diagonalization of a set of matrices by means of a nonsingular matrix. In this paper we provide means to determine the matrix when it has more columns than rows.
منابع مشابه
Four equivalent sets of mixed-model equations with relationship matrix for estimation of genetic parameters.
Four equivalent approaches of estimating variance components from mixed-model equations including the relationship matrix are presented. One procedure involves simultaneous diagonalization of the coefficient matrix (Z'MZ) and the inverse of the numerator relationship matrix (A-1). After simultaneous diagonalization, the absorbed coefficient matrix of the mixed-model equations is diagonal, so so...
متن کاملSimultaneous diagonalization: the asymmetric, low-rank, and noisy settings
Simultaneous matrix diagonalization is used as a subroutine in many machine learning problems, including blind source separation and paramater estimation in latent variable models. Here, we extend algorithms for performing joint diagonalization to low-rank and asymmetric matrices, and we also provide extensions to the perturbation analysis of these methods. Our results allow joint diagonalizati...
متن کاملGlobally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651–672, 2013], we prove its global convergence for simultaneous orthogonal diagonalization of symmetric matrices and 3rd-order tensors. We also propose a new Jacobi-based algorithm in the gen...
متن کاملScaling Up Simultaneous Diagonalization
Simultaneous matrix diagonalization is a key subroutine in many machine learning problems, including blind source separation and parameter estimation in latent variable models. Here, we extend joint diagonalization algorithms to low-rank and asymmetric matrices and also provide extensions to the perturbation analysis of these methods. Our results allow joint diagonalization to scale to larger p...
متن کاملApproximate diagonalization approach to blind source separation with a subset of matrices
In Blind Source Separation problems it is assumed that the approximate diagonalization of a matrix set achieves more robust solutions than the simultaneous diagonalization of a matrix pencil. In this work we will analyse approximate diagonalization methods using a generalized eigendecomposition (GED) of any pair of a given matrix set. The constraints of GED solutions provide a criterion to choo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003